On the Properties of Algebraic Geometric Codes as Copy Protection Codes
نویسندگان
چکیده
Traceability schemes that are applied to broadcast encryption can prevent unauthorized parties from accessing the distributed data. In a traceability scheme, distributor broadcasts encrypted data and gives each authorized user unique key identifying word selected error-correcting code for decrypting. The following attack is possible in these schemes: groups of c malicious users join into coalitions gain illegal access by combining their keys codewords obtain pirate codeword. To this type attack, classes codes with special c-FP c-TA properties used. particular, make direct compromise scrupulous impossible it identify one attackers. We considering problem evaluating lower upper boundaries on c, within which L-construction algebraic geometric have corresponding properties. case an arbitrary curve, bound property was obtained earlier; paper, constructed. curves infinite point, bounds value both During our work, we proven auxiliary lemma proof contains explicit way build coalition pirate-identifying vector. Methods principles presented be important analyzing schemes’ robustness. Also, boundaries’ monotonicity subcodes proven.
منابع مشابه
Algebraic Geometric Codes on Surfaces
— We study error-correcting codes constructed from projective surfaces over finite fields using the generalized Goppa construction. We obtain bounds for the minimal distance of these codes by understanding how the zero sets of functions on a surface decompose into irreducible components. We also present a decoding algorithm for these codes based on the Luby-Mitzenmacher algorithm for LDPC codes...
متن کاملNotes on Algebraic-geometric Codes
Ideas from algebraic geometry became useful in coding theory after Goppa’s construction [8]. He had the beautiful idea of associating to a curve X defined over Fq, the finite field with q elements, a code C. This code, called Algebraic-Geometric (AG) code, is constructed from two divisors D and G on X , where one of them, say D, is the sum of n distinct Fq-rational points of X . It turns out th...
متن کاملOn the Construction of Algebraic-Geometric Codes
In this paper, a new view point to linear codes is presented. A concept level of linear codes is introduced and a bound of linear code’s level is given. It can be used to simplify the construction of Algebraic Geometric Codes. In particular, we define a class of codes which can be considerated as generalized RS codes and can be constructed via symbolic computation.
متن کاملOn the decoding of algebraic-geometric codes
This paper provides a survey of the existing literature on the decoding of algebraic-geometric codes. Definitions, theorems and cross references will be given. We show what has been done, discuss what still has to be done and pose some open problems. The following subjects are examined in a more or less historical order. 1) Introduction 2) The decoding problem 3) Algebraic-geometric codes 4) Th...
متن کاملUnderstanding Algebraic-Geometric Codes
Error-correcting codes derived from curves in an algebraic geometry are called Algebraic-Geometry Codes. The past couple of decades has seen extraordinary developments in the application of the ideas of algebraic geometry to the construction of codes and their decoding algorithms. This was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed-Solomon (RS), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatic Control and Computer Sciences
سال: 2021
ISSN: ['0146-4116', '1558-108X']
DOI: https://doi.org/10.3103/s014641162107021x